Statistical inference on attributed random graphs: Fusion of graph features and content: An experiment on time series of Enron graphs

نویسندگان

  • Carey E. Priebe
  • Youngser Park
  • David J. Marchette
  • John M. Conroy
  • John Grothendieck
  • Allen L. Gorin
چکیده

Fusion of information from graph features and content can provide superior inference for an anomaly detection task, compared to the corresponding content-only or graph featureonly statistics. In this paper, we design and execute an experiment on a time series of attributed graphs extracted from the Enron email corpus which demonstrates the benefit of fusion. The experiment is based on injecting a controlled anomaly into the real data and measuring its detectability. © 2010 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical inference on attributed random graphs: Fusion of graph features and content

Many problems can be cast as statistical inference on an attributed random graph. Our motivation is change detection in communication graphs. We prove that tests based on a fusion of graph-derived and content-derived metadata can be more powerful than those based on graph or content features alone. For some basic attributed random graphmodels, we derive fusion tests from the likelihood ratio. W...

متن کامل

Anomaly Detection using Adaptive Fusion of Graph Features on a Time Series of Graphs

Abstract It is known that fusion of information from graph features, compared to individual features, can provide superior inference for anomaly detection [PPM10]. However, selection of a fusion technique other than a naive equal weighting is not trivial. We present a multivariate methodology for fusion of features derived from time series of graphs, and investigate its inferential efficacy. Th...

متن کامل

A latent process model for time series of attributed random graphs

We introduce a latent process model for time series of attributed random graphs for characterizing multiple modes of association among a collection of actors over time. Two mathematically tractable approximations are derived, and we examine the performance of a class of test statistics for an illustrative change-point detection problem and demonstrate that the analysis through approximation can...

متن کامل

A survey of the studies on Gallai and anti-Gallai graphs

The Gallai graph and the anti-Gallai graph of a graph G are edge disjoint spanning subgraphs of the line graph L(G). The vertices in the Gallai graph are adjacent if two of the end vertices of the corresponding edges in G coincide and the other two end vertices are nonadjacent in G. The anti-Gallai graph of G is the complement of its Gallai graph in L(G). Attributed to Gallai (1967), the study ...

متن کامل

Work Hard, Play Hard: Email Classification on the Avocado and Enron Corpora

In this paper, we present an empirical study of email classification into two main categories “Business” and “Personal”. We train on the Enron email corpus, and test on the Enron and Avocado email corpora. We show that information from the email exchange networks improves the performance of classification. We represent the email exchange networks as social networks with graph structures. For th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2010